/*
//1 2 2 3 3 4
#include<bits/stdc++.h>
using namespace std;
const int N = 1e5+10;
int n, q, k;
int a[N];
int main()
{
	scanf("%d %d", &n, &q);
	for(int i=0; i<n; i++)
	  scanf("%d", &a[i]);
	while(q--)
	{
		int x;
		scanf("%d", &x);
		int l=0, r=n-1;
	    while(l<r)
	    {
			int mid=(l+r)>>1;
			if(a[mid]>=x)
				r=mid;
		    else
		        l=mid+1;
		}
		if(a[l]!= x)//?
		  cout<<"-1 -1"<<endl;
		else
		{
			cout<<l<<' ';
			int l=0, r=n-1;
			while(l<r)
			{
				int mid=l+r+1>>1;
				if(a[mid]<=x)
			      l=mid;
				else
				  r=mid-1; 
			}
			cout<<l<<endl;
		}
	}
	return 0;
}
*/
#include<bits/stdc++.h>
using namespace std;
const int N = 1e5+10;
int n, m, k;
int q[N];
int main()
{
	scanf("%d %d", &n, &m);
	for(int i=0; i<n; i++)
        scanf("%d", &q[i]);
    while(m--)
    {
		scanf("%d", &k);
		int l=0,r=n-1;
		
		while(l<r)
		{
		   int mid=(l+r)/2;
		   if(q[mid]>=k)
		   	  r=mid;
		   	else
		   	  l=mid+1;
		}
        	if(q[l]!=k)
			cout<<"-1 -1"<<endl;
			else
			{	
			    cout<<l<<' ';
			    int l=0, r=n-1;
			    while(l<r)
			    {
				int mid=(l+r+1)/2;
				if(q[mid]<k)
					l=mid+1;
				else
				    r=mid;
			    }
				cout<<l<<endl;
			}
	}
	return 0;
}





















